A heuristic approach for load balancing the FP-growth algorithm on MapReduce
نویسندگان
چکیده
منابع مشابه
A New Load Balancing Approach for Parallel FP-Growth
Due to the exponential growth in worldwide information, companies have to deal with an ever growing amount of digital information. So the huge size of data and computation volume of new processing applications such as data mining, leads to new high performance parallel processing systems. One of the most important challenges of such application is quickly and correctly finding the relationship ...
متن کاملA New Fuzzy Approach for Dynamic Load Balancing Algorithm
Load balancing is the process of improving the Performance of a parallel and distributed system through is distribution of load among the processors[1-2]. Most of the previous work in load balancing and distributed decision making in general, do not effectively take into account the uncertainty and inconsistency in state information but in fuzzy logic, we have advantage of using crisps inputs. ...
متن کاملAdaptive Load Balancing in MapReduce using Flubber
MapReduce has emerged as a successful framework for addressing the heavy demand for large-scale analytical data processing, in this peta-byte age. However, while on one hand the sheer size of data makes problems more challenging, the flexibility offered by the MapReduce frameworks on the other hand, makes the learning curve far steeper than expected. The general idea behind a MapReduce framewor...
متن کاملANT-LOAD: A Proficient Meta-Heuristic Cloud Load Balancing
The Cloud computing is an embryonic as an innovative hypothesis of gigantic distributed calculation. Load balancing, the main trial in cloud computing, requires to allocate the vibrant workload uniformly across all of the machines. Burden balancing leads to a high user satisfaction and resource utilization ratio by confirming a proficient and fair allocating of all of the resources. Burden Bala...
متن کاملa swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach
periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Array
سال: 2020
ISSN: 2590-0056
DOI: 10.1016/j.array.2020.100035